National Repository of Grey Literature 6 records found  Search took 0.01 seconds. 
Quadratic Assignment Problem – reformulations and lower bounds
Liška, Ondřej ; Matoušek, Radomil (referee) ; Popela, Pavel (advisor)
This bachelor thesis is focused on quadratic assignment problém. In first part are introduced assignment problems, include basic application. After description of problem and marking convention follows introducing of selected solution metods. In third part are compared solution metods, which are implemented i Julia language with solver Gurobi.
Quadratic Assignment Problem – reformulations and lower bounds
Liška, Ondřej ; Matoušek, Radomil (referee) ; Popela, Pavel (advisor)
This bachelor thesis is focused on quadratic assignment problém. In first part are introduced assignment problems, include basic application. After description of problem and marking convention follows introducing of selected solution metods. In third part are compared solution metods, which are implemented i Julia language with solver Gurobi.
Assignment problem and its particular application in passenger transport
Asterová, Jana ; Jablonský, Josef (advisor) ; Fábry, Jan (referee)
This thesis is focused on the topic of assignment problems. The theoretical part presents a summary of the most important previously published findings on linear and quadratic assignment problem. The basic formulations of both problems are introduced, as well as the outline of some methods developed for their solution. Finally both problems are illustrated by practical applications that have appeared in the literature. The practical part gives insight into the issue of assignment of transport orders to drivers in a company and proposes a suitable model that speeds up the process of distributing the orders. The transfers conducted by the company start at the airport and terminate in a hotel in the city centre of Prague or vice versa. When proposing order schedules for the drivers, it is necessary to take into account not only the time of the transfers, but additionally the capacity and the category of the vehicle.
Analýza trasování a vytíženosti manipulantů v lisovací hale
Bark, Ondřej ; Borovička, Adam (advisor) ; Fábry, Jan (referee)
The diploma thesis focuses on tracing in layout by handlers between assembly lines in new plant for corporation Continental Automotive Czech Republic ltd, where boosters are produced. The theoretical part involves definitions of logistics, supply chain, material flow and handling equipment. Furthermore, methods of mathematic programming and software equipment are described, such as quadratic assignment problem, knapsack problem, travelling salesman problem from graph theory. In the practical part the situation in corporation has been analyzed and the data prepared for further examination. Then layout of plant and internal processes are evaluated and an appropriate model or concept of solution is selected. Subsequently, application in MS Excel is created with support of VBA scripts (3 kinds of layouts). The user manipulates with application followed by Solver for implementation of a new solution into practice. Finally, the models are interpreted and verified by Lingo. The focus of the thesis is the design of a layout change of a new plant including the description of tracing.
Optimization of logistics and business processes in Bookretail s.r.o.
Hollayová, Nela ; Zouhar, Jan (advisor) ; Kuncová, Martina (referee)
The subject of the thesis is the optimization of one the key processes in a book company, namely warehouse logistics. This problem consist of two parts; first part focuses on route optimization of completion of customers' orders on daily basis, second part focuses on assigning of storage subsystems and their interconnection. The proposed solution uses a traveller salesman problem implemented into intranet application. Second problem was designed as quadratic assignment problem with use of ex post data analysis. On the basis of achieved results, we presented effective procedures for solving both of aforementioned problems and suggested their implementation into the company's enterprise resource planning system. Keywords:
The quadratic assignment problem and its solution
Nováčková, Monika ; Jablonský, Josef (advisor) ; Fábry, Jan (referee)
The QAP (quadratic assignment problem) is one of the most involved combinatorial optimization problems. This formidable decision problem is included in the complexity class called NP-complete. The QAP has been first time introduced by Koopmans and Beckman in year 1957. Since then the various methods for solving this problem have been investigated. The studied methods include both: exact algorithms and heuristic methods. Some of them will be shortly described in this paper. One of them, the branch and bound algorithm based on Gilmore Lawler bounds will be analyzed in detail. View applications of this problem will be also discussed. Described applications include the problem of localization of the departments or clinics in a hospital in order to minimize the total traveling distance among clinics by patients. Another described example of application of this problem is the task how to place the components on a computer motherboard optimally.

Interested in being notified about new results for this query?
Subscribe to the RSS feed.